0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.09 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.08/0.29 % Computer : n017.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 1920 0.08/0.29 % WCLimit : 240 0.08/0.29 % DateTime : Wed Jul 30 05:55:49 EDT 2025 0.08/0.29 % CPUTime : 0.15/0.40 Running higher-order theorem proving 0.15/0.40 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p 0.15/0.41 # Version: 3.0.0-ho 0.15/0.41 # Preprocessing class: HSSSSMSSSSSNSFA. 0.15/0.41 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.15/0.41 # Starting new_ho_14 with 1200s (5) cores 0.15/0.41 # Starting full_lambda_8 with 240s (1) cores 0.15/0.41 # Starting new_ho_13 with 240s (1) cores 0.15/0.41 # Starting ho_unfolding_3 with 240s (1) cores 0.15/0.41 # new_ho_14 with pid 24627 completed with status 0 0.15/0.41 # Result found by new_ho_14 0.15/0.41 # Preprocessing class: HSSSSMSSSSSNSFA. 0.15/0.41 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.15/0.41 # Starting new_ho_14 with 1200s (5) cores 0.15/0.41 # SinE strategy is gf500_gu_R04_F100_L20000 0.15/0.41 # Search class: HGHSF-FFSF11-MSFFFSBN 0.15/0.41 # partial match(2): HGUSF-FFSF11-SSFFFSBN 0.15/0.41 # Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total) 0.15/0.41 # Starting new_ho_14 with 721s (1) cores 0.15/0.41 # Starting new_ho_13 with 121s (1) cores 0.15/0.41 # Starting ho_unfolding_6 with 121s (1) cores 0.15/0.41 # Starting sh4l with 121s (1) cores 0.15/0.41 # Starting full_lambda_8 with 116s (1) cores 0.15/0.41 # full_lambda_8 with pid 24638 completed with status 0 0.15/0.41 # Result found by full_lambda_8 0.15/0.41 # Preprocessing class: HSSSSMSSSSSNSFA. 0.15/0.41 # Scheduled 4 strats onto 8 cores with 240 seconds (1920 total) 0.15/0.41 # Starting new_ho_14 with 1200s (5) cores 0.15/0.41 # SinE strategy is gf500_gu_R04_F100_L20000 0.15/0.41 # Search class: HGHSF-FFSF11-MSFFFSBN 0.15/0.41 # partial match(2): HGUSF-FFSF11-SSFFFSBN 0.15/0.41 # Scheduled 5 strats onto 5 cores with 1200 seconds (1200 total) 0.15/0.41 # Starting new_ho_14 with 721s (1) cores 0.15/0.41 # Starting new_ho_13 with 121s (1) cores 0.15/0.41 # Starting ho_unfolding_6 with 121s (1) cores 0.15/0.41 # Starting sh4l with 121s (1) cores 0.15/0.41 # Starting full_lambda_8 with 116s (1) cores 0.15/0.41 # Preprocessing time : 0.001 s 0.15/0.41 # Presaturation interreduction done 0.15/0.41 0.15/0.41 # Proof found! 0.15/0.41 # SZS status Theorem 0.15/0.41 # SZS output start CNFRefutation 0.15/0.41 thf(decl_sort1, type, nat: $tType). 0.15/0.41 thf(decl_sort2, type, set: $tType). 0.15/0.41 thf(decl_23, type, x: nat). 0.15/0.41 thf(decl_24, type, suc: nat > nat). 0.15/0.41 thf(decl_25, type, esti: nat > set > $o). 0.15/0.41 thf(decl_26, type, setof: (nat > $o) > set). 0.15/0.41 thf(decl_27, type, n_1: nat). 0.15/0.41 thf(decl_28, type, esk1_1: set > nat). 0.15/0.41 thf(estii, axiom, ![X1:nat > $o, X2:nat]:(((esti @ X2 @ (setof @ X1))<=(X1 @ X2))), file('/export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p', estii)). 0.15/0.41 thf(estie, axiom, ![X1:nat > $o, X2:nat]:(((X1 @ X2)<=(esti @ X2 @ (setof @ X1)))), file('/export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p', estie)). 0.15/0.41 thf(ax3, axiom, ![X3:nat]:(((suc @ X3)!=(n_1))), file('/export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p', ax3)). 0.15/0.41 thf(satz2, conjecture, ((suc @ x)!=(x)), file('/export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p', satz2)). 0.15/0.41 thf(satz1, axiom, ![X3:nat, X4:nat]:((((suc @ X3)!=(suc @ X4))<=((X3)!=(X4)))), file('/export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p', satz1)). 0.15/0.41 thf(ax5, axiom, ![X5:set]:(((esti @ n_1 @ X5)=>(![X3:nat]:(((esti @ X3 @ X5)=>(esti @ (suc @ X3) @ X5)))=>![X3:nat]:((esti @ X3 @ X5))))), file('/export/starexec/sandbox/tmp/tmp.RagatLgOXO/E---3.1_24549.p', ax5)). 0.15/0.41 thf(c_0_6, plain, ![X1:nat > $o, X2:nat]:(((X1 @ X2)=>(esti @ X2 @ (setof @ X1)))), inference(fof_simplification,[status(thm)],[estii])). 0.15/0.41 thf(c_0_7, plain, ![X1:nat > $o, X2:nat]:(((esti @ X2 @ (setof @ X1))=>(X1 @ X2))), inference(fof_simplification,[status(thm)],[estie])). 0.15/0.41 thf(c_0_8, plain, ![X3:nat]:(((suc @ X3)!=(n_1))), inference(fof_simplification,[status(thm)],[ax3])). 0.15/0.41 thf(c_0_9, plain, ![X24:nat > $o, X25:nat]:((~(X24 @ X25)|(esti @ X25 @ (setof @ X24)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])). 0.15/0.41 thf(c_0_10, negated_conjecture, ((suc @ x)=(x)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz2])])). 0.15/0.41 thf(c_0_11, plain, ![X3:nat, X4:nat]:((((X3)!=(X4))=>((suc @ X3)!=(suc @ X4)))), inference(fof_simplification,[status(thm)],[satz1])). 0.15/0.41 thf(c_0_12, plain, ![X22:nat > $o, X23:nat]:((~(esti @ X23 @ (setof @ X22))|(X22 @ X23))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])). 0.15/0.41 thf(c_0_13, plain, ![X19:set, X21:nat]:((((esti @ (esk1_1 @ X19) @ X19)|(esti @ X21 @ X19)|~(esti @ n_1 @ X19))&(~(esti @ (suc @ (esk1_1 @ X19)) @ X19)|(esti @ X21 @ X19)|~(esti @ n_1 @ X19)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax5])])])])])])). 0.15/0.41 thf(c_0_14, plain, ![X16:nat]:(((suc @ X16)!=(n_1))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])])). 0.15/0.41 thf(c_0_15, plain, ![X1:nat > $o, X2:nat]:(((esti @ X2 @ (setof @ X1))|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.15/0.41 thf(c_0_16, negated_conjecture, ((suc @ x)=(x)), inference(split_conjunct,[status(thm)],[c_0_10])). 0.15/0.41 thf(c_0_17, plain, ![X17:nat, X18:nat]:((((X17)=(X18))|((suc @ X17)!=(suc @ X18)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])). 0.15/0.41 thf(c_0_18, plain, ![X2:nat, X1:nat > $o]:(((X1 @ X2)|~((esti @ X2 @ (setof @ X1))))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.15/0.41 thf(c_0_19, plain, ![X2:nat, X5:set]:(((esti @ (esk1_1 @ X5) @ X5)|(esti @ X2 @ X5)|~((esti @ n_1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.15/0.41 thf(c_0_20, plain, ![X2:nat]:(((suc @ X2)!=(n_1))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.15/0.41 thf(c_0_21, plain, ![X2:nat]:(((esti @ X2 @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0))))))|((X2)=(suc @ X2)))), inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]), c_0_15, c_0_16])). 0.15/0.41 thf(c_0_22, plain, ![X2:nat, X3:nat]:((((X2)=(X3))|((suc @ X2)!=(suc @ X3)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.15/0.41 thf(c_0_23, plain, ![X2:nat]:((((X2)!=(suc @ X2))|~((esti @ X2 @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0))))))))), inference(trigger,[status(thm)],[inference(cn,[status(thm)],[]), c_0_18, c_0_16])). 0.15/0.41 thf(c_0_24, plain, ![X5:set]:(((esti @ (esk1_1 @ X5) @ X5)|~((esti @ n_1 @ X5)))), inference(condense,[status(thm)],[c_0_19])). 0.15/0.41 thf(c_0_25, plain, (esti @ n_1 @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0)))))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21])])). 0.15/0.41 thf(c_0_26, plain, ![X2:nat, X5:set]:(((esti @ X2 @ X5)|~((esti @ (suc @ (esk1_1 @ X5)) @ X5))|~((esti @ n_1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.15/0.41 thf(c_0_27, plain, ![X2:nat]:((((suc @ X2)=(X2))|(esti @ (suc @ X2) @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0)))))))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_21])])). 0.15/0.41 thf(c_0_28, plain, ((suc @ (esk1_1 @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0)))))))!=(esk1_1 @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0))))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])])). 0.15/0.41 thf(c_0_29, plain, ![X2:nat]:((esti @ X2 @ (setof @ (^[Z0/* 4 */:nat]:(((Z0)!=(suc @ Z0))))))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_25])]), c_0_28])). 0.15/0.41 thf(c_0_30, plain, ![X2:nat]:(((suc @ X2)!=(X2))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23, c_0_29])])). 0.15/0.41 thf(c_0_31, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_16, c_0_30]), ['proof']). 0.15/0.41 # SZS output end CNFRefutation 0.15/0.41 # Parsed axioms : 13 0.15/0.41 # Removed by relevancy pruning/SinE : 7 0.15/0.41 # Initial clauses : 7 0.15/0.41 # Removed in clause preprocessing : 0 0.15/0.41 # Initial clauses in saturation : 9 0.15/0.41 # Processed clauses : 35 0.15/0.41 # ...of these trivial : 0 0.15/0.41 # ...subsumed : 7 0.15/0.41 # ...remaining for further processing : 28 0.15/0.41 # Other redundant clauses eliminated : 3 0.15/0.41 # Clauses deleted for lack of memory : 0 0.15/0.41 # Backward-subsumed : 2 0.15/0.41 # Backward-rewritten : 4 0.15/0.41 # Generated clauses : 30 0.15/0.41 # ...of the previous two non-redundant : 22 0.15/0.41 # ...aggressively subsumed : 0 0.15/0.41 # Contextual simplify-reflections : 0 0.15/0.41 # Paramodulations : 24 0.15/0.41 # Factorizations : 0 0.15/0.41 # NegExts : 0 0.15/0.41 # Equation resolutions : 4 0.15/0.41 # Disequality decompositions : 0 0.15/0.41 # Total rewrite steps : 8 0.15/0.41 # ...of those cached : 3 0.15/0.41 # Propositional unsat checks : 0 0.15/0.41 # Propositional check models : 0 0.15/0.41 # Propositional check unsatisfiable : 0 0.15/0.41 # Propositional clauses : 0 0.15/0.41 # Propositional clauses after purity: 0 0.15/0.41 # Propositional unsat core size : 0 0.15/0.41 # Propositional preprocessing time : 0.000 0.15/0.41 # Propositional encoding time : 0.000 0.15/0.41 # Propositional solver time : 0.000 0.15/0.41 # Success case prop preproc time : 0.000 0.15/0.41 # Success case prop encoding time : 0.000 0.15/0.41 # Success case prop solver time : 0.000 0.15/0.41 # Current number of processed clauses : 12 0.15/0.41 # Positive orientable unit clauses : 3 0.15/0.41 # Positive unorientable unit clauses: 0 0.15/0.41 # Negative unit clauses : 3 0.15/0.41 # Non-unit-clauses : 6 0.15/0.41 # Current number of unprocessed clauses: 5 0.15/0.41 # ...number of literals in the above : 11 0.15/0.41 # Current number of archived formulas : 0 0.15/0.41 # Current number of archived clauses : 16 0.15/0.41 # Clause-clause subsumption calls (NU) : 7 0.15/0.41 # Rec. Clause-clause subsumption calls : 7 0.15/0.41 # Non-unit clause-clause subsumptions : 4 0.15/0.41 # Unit Clause-clause subsumption calls : 8 0.15/0.41 # Rewrite failures with RHS unbound : 0 0.15/0.41 # BW rewrite match attempts : 4 0.15/0.41 # BW rewrite match successes : 4 0.15/0.41 # Condensation attempts : 35 0.15/0.41 # Condensation successes : 1 0.15/0.41 # Termbank termtop insertions : 972 0.15/0.41 # Search garbage collected termcells : 156 0.15/0.41 0.15/0.41 # ------------------------------------------------- 0.15/0.41 # User time : 0.005 s 0.15/0.41 # System time : 0.002 s 0.15/0.41 # Total time : 0.007 s 0.15/0.41 # Maximum resident set size: 1884 pages 0.15/0.41 0.15/0.41 # ------------------------------------------------- 0.15/0.41 # User time : 0.017 s 0.15/0.41 # System time : 0.008 s 0.15/0.41 # Total time : 0.025 s 0.15/0.41 # Maximum resident set size: 1732 pages 0.15/0.41 % E exiting 0.15/0.42 % E exiting 0.15/0.42 EOF